package 笔试;

import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class 魔法传送 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int t = scan.nextInt();
        int[] nums = new int[n];
        for (int i = 0; i < n; i++) {
            nums[i] = scan.nextInt();
        }
        Arrays.sort(nums);
        int count = 0;
        int[] tmps = new int[n+1];
        for (int i = n-1; i >= 0 ; i--) {
            int tmp = nums[i] / t;
            if(tmp <= n) {
                while (tmps[tmp] >= 1) {
                    tmp--;
                }
                if(tmp <= 0) {
                    count++;
                } else {
                    tmps[tmp] ++;
                }
            }
        }
        System.out.println(count);
    }
}
